Tsvi Kopelowitz: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

Generalized substring compression

Keller, Orgad, Kopelowitz, Tsvi, Landau Feibish, Shir, Lewenstein, Moshe

Journal:

Theoretical Computer Science

Year:

2014

Language:

english

File:

PDF, 564 KB

english, 2014

2

[ACM Press the 28th ACM Symposium - Pacific Grove, California, USA (2016.07.11-2016.07.13)] Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures - SPAA '16 - The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets

Amir, Amihood, Kapah, Oren, Kopelowitz, Tsvi, Naor, Moni, Porat, Ely

Year:

2016

Language:

english

File:

PDF, 977 KB

english, 2016

3

Property matching and weighted matching

Amihood Amir, Eran Chencinski, Costas Iliopoulos, Tsvi Kopelowitz, Hui Zhang

Journal:

Theoretical Computer Science

Year:

2008

Language:

english

File:

PDF, 394 KB

english, 2008

4

Improved Algorithms for Polynomial-Time Decay and

Tsvi Kopelowitz, Ely Porat

Journal:

Theory of Computing Systems

Year:

2008

Language:

english

File:

PDF, 320 KB

english, 2008

5

On the longest common parameterized subsequence

Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein

Journal:

Theoretical Computer Science

Year:

2009

Language:

english

File:

PDF, 484 KB

english, 2009

6

Cross-document pattern matching

Kopelowitz, Tsvi, Kucherov, Gregory, Nekrich, Yakov, Starikovskaya, Tatiana

Journal:

Journal of Discrete Algorithms

Year:

2014

Language:

english

File:

PDF, 274 KB

english, 2014

7

Suffix Trays and Suffix Trists: Structures for Faster Text Indexing

Cole, Richard, Kopelowitz, Tsvi, Lewenstein, Moshe

Journal:

Year:

2015

Language:

english

File:

PDF, 638 KB

english, 2015

8

[IEEE 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS) - New Brunswick, NJ, USA (2012.10.20-2012.10.23)] 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science - On-Line Indexing for General Alphabets via Predecessor Queries on Subsets of an Ordered List

Kopelowitz, Tsvi

Year:

2012

Language:

english

File:

PDF, 217 KB

english, 2012

9

Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing

Amir, Amihood, Franceschini, Gianni, Grossi, Roberto, Kopelowitz, Tsvi, Lewenstein, Moshe, Lewenstein, Noa

Journal:

SIAM Journal on Computing

Year:

2014

Language:

english

File:

PDF, 273 KB

english, 2014

10

[IEEE 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA, USA (2015.10.17-2015.10.20)] 2015 IEEE 56th Annual Symposium on Foundations of Computer Science - Breaking the Variance: Approximating the Hamming Distance in 1/&amp;#x3B5; Time Per Alignment

Kopelowitz, Tsvi, Porat, Ely

Year:

2015

Language:

english

File:

PDF, 244 KB

english, 2015

11

The property suffix tree with dynamic properties

Kopelowitz, Tsvi

Journal:

Theoretical Computer Science

Year:

2016

Language:

english

File:

PDF, 534 KB

english, 2016

12

Sparse Text Indexing in Small Space

Bille, Philip, Fischer, Johannes, Gørtz, Inge Li, Kopelowitz, Tsvi, Sach, Benjamin, Vildhøj, Hjalte Wedel

Journal:

ACM Transactions on Algorithms

Year:

2016

Language:

english

File:

PDF, 386 KB

english, 2016

13

[ACM Press the 48th Annual ACM SIGACT Symposium - Cambridge, MA, USA (2016.06.19-2016.06.21)] Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016 - Contention resolution with log-logstar channel accesses

Bender, Michael A., Kopelowitz, Tsvi, Pettie, Seth, Young, Maxwell

Year:

2016

Language:

english

File:

PDF, 396 KB

english, 2016

14

[IEEE 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) - New Brunswick, NJ, USA (2016.10.9-2016.10.11)] 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) - An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model

Chang, Yi-Jun, Kopelowitz, Tsvi, Pettie, Seth

Year:

2016

Language:

english

File:

PDF, 293 KB

english, 2016

15

[ACM Press the 49th Annual ACM SIGACT Symposium - Montreal, Canada (2017.06.19-2017.06.23)] Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 - Exponential separations in the energy complexity of leader election

Chang, Yi-Jun, Kopelowitz, Tsvi, Pettie, Seth, Wang, Ruosong, Zhan, Wei

Year:

2017

Language:

english

File:

PDF, 1.46 MB

english, 2017

16

[Society for Industrial and Applied Mathematics Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms - ()] Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms - Higher Lower Bounds from the 3SUM Conjecture

Kopelowitz, Tsvi, Pettie, Seth, Porat, Ely

Language:

english

File:

PDF, 241 KB

english

17

An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model

Chang, Yi-Jun, Kopelowitz, Tsvi, Pettie, Seth

Journal:

SIAM Journal on Computing

Year:

2019

Language:

english

File:

PDF, 466 KB

english, 2019

18

Mind the Gap!

Amir, Amihood, Kopelowitz, Tsvi, Levy, Avivit, Pettie, Seth, Porat, Ely, Shalom, B. Riva

Journal:

Year:

2019

Language:

english

File:

PDF, 1.00 MB

english, 2019

19

Mind the Gap!

Amir, Amihood, Kopelowitz, Tsvi, Levy, Avivit, Pettie, Seth, Porat, Ely, Shalom, B. Riva

Journal:

Year:

2019

File:

PDF, 1.00 MB

2019

20

Streaming Pattern Matching with d Wildcards

Golan, Shay, Kopelowitz, Tsvi, Porat, Ely

Journal:

Year:

2019

Language:

english

File:

PDF, 1.10 MB

english, 2019

21

Exponential Separations in the Energy Complexity of Leader Election

Chang, Yi-Jun, Kopelowitz, Tsvi, Pettie, Seth, Wang, Ruosong, Zhan, Wei

Journal:

ACM Transactions on Algorithms

Year:

2019

Language:

english

File:

PDF, 830 KB

english, 2019

22

[Society for Industrial and Applied Mathematics Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms - ()] Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms - Fully Dynamic Connectivity in O (log n (log log n ) 2 ) Amortized Expected Time

Huang, Shang-En, Huang, Dawei, Kopelowitz, Tsvi, Pettie, Seth

Language:

english

File:

PDF, 434 KB

english

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@z-lib.do

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски